Meier, Arne; Mundhenk, Martin; Thomas, Michael; Vollmer, Heribert
(Amsterdam : Elsevier BV, 2008)
The satisfiability problems for CTL and CTL⋆ are known to be EXPTIME-complete, resp. 2EXPTIME-complete (Fischer and Ladner (1979), Vardi and Stockmeyer (1985)). For fragments that use less temporal or propositional operators, ...